An improved LLL algorithm
نویسندگان
چکیده
6 The LLL algorithm has received a lot of attention as an effective numerical tool for preconditioning 7 an integer least squares problem. However, the workings of the algorithm are not well understood. In this 8 paper, we present a new way to look at the LLL reduction, which leads to a new implementation method 9 that performs better than the original LLL scheme. 10 © 2007 Published by Elsevier Inc. 11
منابع مشابه
A modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملExperimental quality evaluation of lattice basis reduction methods for decorrelating low-dimensional integer least squares problems
Reduction can be important to aid quickly attaining the integer least squares (ILS) estimate from noisy data. We present an improved Lenstra-Lenstra-Lovasz (LLL) algorithm with fixed complexity by extending a parallel reduction method for positive definite quadratic forms to lattice vectors. We propose the minimum angle of a reduced basis as an alternative quality measure of orthogonality, whic...
متن کاملLattices in Computer Science Lecture 2 LLL Algorithm
Lattices in Computer Science Lecture 2 LLL Algorithm Lecturer: Oded Regev Scribe: Eyal Kaplan In this lecture1 we describe an approximation algorithm to the Shortest Vector Problem (SVP). This algorithm, developed in 1982 by A. K. Lenstra, H. W. Lenstra, Jr. and L. Lovasz, usually called the LLL algorithm, gives a ( 2 √ 3 ) n approximation ratio, where n is the dimension of the lattice. In many...
متن کاملSegment LLL Reduction of Lattice Bases Using Modular Arithmetic
The algorithm of Lenstra, Lenstra, and Lovász (LLL) transforms a given integer lattice basis into a reduced basis. Storjohann improved the worst case complexity of LLL algorithms by a factor of O(n) using modular arithmetic. Koy and Schnorr developed a segment-LLL basis reduction algorithm that generates lattice basis satisfying a weaker condition than the LLL reduced basis with O(n) improvemen...
متن کاملAn Efficient LLL Gram Using Buffered Transformations
In this paper we introduce an improved variant of the LLL algorithm. Using the Gram matrix to avoid expensive correction steps necessary in the Schnorr-Euchner algorithm and introducing the use of buffered transformations allows us to obtain a major improvement in reduction time. Unlike previous work, we are able to achieve the improvement while obtaining a strong reduction result and maintaini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007